Skip to content

O(n) -> O(n-1) #5

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom
Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

O(n) -> O(n-1) #5

wants to merge 1 commit into from

Conversation

soitsmutiny
Copy link

No description provided.

@iamtakingiteasy
Copy link

This would close #7

@tetafro
Copy link

tetafro commented Feb 17, 2020

Also there's no such thing as O(n-1). It is still O(n).

@iamtakingiteasy
Copy link

If you mean complexity growth is linear, yes, it remains linear, but actual complexity is reduced from n cycles to n-1 cycles for any given n.

@mizabrik
Copy link

Also there's no such thing as O(n-1). It is still O(n).

Nope, there is. It's exactly the same thing as O(n).

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Reviewers
No reviews
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

Successfully merging this pull request may close these issues.
4 participants
@soitsmutiny @iamtakingiteasy @tetafro @mizabrik